Shake-and-Bake MT and Morphology*
نویسنده
چکیده
We will address the issue of designing MT systems where the capability to reuse grammars taken off the shelf is maximized, thus restricting the need for application-specific work. Or. to put it in a slightly different way, our proposal is aimed at encouraging the development of pure grammars (i.e. grammars describing languages in the abstract), to be contrasted with those which are extensively tailored for a specific translational use. Our proposal is set on the background of the Shake-and-Bake approach to MT (Whitelock, 1991). In this model translation is achieved by putting in correspondence the bag of lexical items employed in a source sentence with a corresponding bag of lexical items in the target language. The translation of the source sentence is whatever target sentence can be built out of the lexical items in the target bag by freely permuting its elements. We will propose an extension to a standard Shake-and-Bake system in order to support a wider reusability between applications and to give grammar writers more freedom. We will focus on the morphological component of a grammar, which seems to be one of the main bottle-necks which restricts a full portability of grammars under a Shake-and-Bake MT system. It will be shown that the Shake-and-Bake system architecture outranks a number of morphological approaches available in the linguistic literature and it will be discussed how such a restriction can be removed.
منابع مشابه
Some Aspects of Shake-and-bake Machine Translation between English and Italian
Shake-and-Bake is an approach to bidirectional and multilingual Machine Translation which takes advantage of the features of lexically-based uniication grammars to design modular systems, where grammars are written on purely monolingual considerations. An extension to the standard Shake-and-Bake model is proposed in order to increase such peculiarities. It consists in introducing in the system ...
متن کاملAn Efficient Generation Algorithm for Lexicalist MT
The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions. However, the Shake-and-Bake generation algorithm of (Whitelock, 1992) is NPcomplete. We present a polynomial time algorithm for lexicalist MT generation provided that sufficient information can be transferred to ensure more determinism.
متن کاملLetting The Cat Out Of The Bag: Generation For Shake-And-Bake MT
In SLE's approach to multilingual machine translation. [Whitelock, 1991, this conference] we envisage the process of sentence generation as beginning from a multiset or bag of richly structured lexical signs rather than from a conventional logical form or other underlying structure. The translation equivalences are stated between sets of lexical signs, with the superstructure of non-terminal sy...
متن کاملSnB: Applying Shake-and-Bake to Proteins
The Shake-and-Bake algorithm is a powerful formulation of direct methods which alternates reciprocal-space phase refinement with filtering in real space to impose constraints. As implemented in SnB version 1.5, the current distributed version of the computer program, Shake-and-Bake combines peak picking in real space with optimization via either parameter-shift reduction of the minimal-function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995